Lenstra elliptic-curve factorization

Results: 66



#Item
11Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales  6th January 2012, Joint Mathematics Meetings, Boston

Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 6th January 2012, Joint Mathematics Meetings, Boston

Add to Reading List

Source URL: web.maths.unsw.edu.au

Language: English - Date: 2012-01-11 02:12:51
12

PDF Document

Add to Reading List

Source URL: msp.org

Language: English - Date: 2013-11-23 01:41:04
13Direct Division in Factor Rings Christopher Wolf∗   Department of Mathematics ESAT-COSIC

Direct Division in Factor Rings Christopher Wolf∗ Department of Mathematics ESAT-COSIC

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2004-12-18 15:04:16
14A SPECTS OF H YPERELLIPTIC C URVES OVER L ARGE P RIME F IELDS IN S OFTWARE I MPLEMENTATIONS Roberto Maria Avanzi Institute for Experimental Mathematics (IEM) Ellernstrasse 29, DEssen, Germany

A SPECTS OF H YPERELLIPTIC C URVES OVER L ARGE P RIME F IELDS IN S OFTWARE I MPLEMENTATIONS Roberto Maria Avanzi Institute for Experimental Mathematics (IEM) Ellernstrasse 29, DEssen, Germany

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2003-12-17 09:09:41
15Elliptic Curves in Algorithmic Number Theory and Cryptography Otto Forster §1 Applications in Algorithmic Number Theory In this section we describe briefly the use of elliptic curves over finite fields for

Elliptic Curves in Algorithmic Number Theory and Cryptography Otto Forster §1 Applications in Algorithmic Number Theory In this section we describe briefly the use of elliptic curves over finite fields for

Add to Reading List

Source URL: www.mathematik.uni-muenchen.de

Language: English - Date: 2003-12-07 11:29:32
16THE ELLIPTIC CURVE METHOD PAUL ZIMMERMANN The Elliptic Curve Method (ECM for short) was invented in 1985 by H. W. Lenstra, Jr[removed]It is suited to find small — say 9 to 30 digits — prime factors of large numbers. Am

THE ELLIPTIC CURVE METHOD PAUL ZIMMERMANN The Elliptic Curve Method (ECM for short) was invented in 1985 by H. W. Lenstra, Jr[removed]It is suited to find small — say 9 to 30 digits — prime factors of large numbers. Am

Add to Reading List

Source URL: www.loria.fr

Language: English - Date: 2004-09-06 05:03:02
17Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005

Fast arithmetic and pairing evaluation on genus 2 curves David Freeman University of California, Berkeley [removed] November 6, 2005

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2008-06-06 19:27:47
18International Mathematical Olympiad Preliminary Selection Contest 2007 — Hong Kong Outline of Solutions  Answers:

International Mathematical Olympiad Preliminary Selection Contest 2007 — Hong Kong Outline of Solutions Answers:

Add to Reading List

Source URL: www.mathdb.org

Language: English - Date: 2007-10-04 22:57:03
19Reverse Engineering of Strong CryptoSignatures Schemes

Reverse Engineering of Strong CryptoSignatures Schemes

Add to Reading List

Source URL: www.reteam.org

Language: English - Date: 2009-05-17 13:10:56
20Journal de Th´eorie des Nombres de Bordeaux 00 (XXXX), 000–000 Solving conics over function fields par Mark van HOEIJ et John CREMONA ´sume

Journal de Th´eorie des Nombres de Bordeaux 00 (XXXX), 000–000 Solving conics over function fields par Mark van HOEIJ et John CREMONA ´sume

Add to Reading List

Source URL: homepages.warwick.ac.uk

Language: English - Date: 2006-07-31 04:25:06